path metric造句
例句與造句
- It is possible to monitor the noise level on the incoming bit stream by monitoring the rate of growth of the " best " path metric.
- A physical implementation of a viterbi decoder will not yield an " exact " maximum-likelihood stream due to quantization of the input signal, branch and path metrics, and finite " traceback length ".
- A path metric unit summarizes branch metrics to get metrics for 2 ^ { K-1 } paths, where K is the constraint length of the code, one of which can eventually be chosen as " optimal ".
- If G is a connected finite-dimensional Lie group equipped with a left-invariant Riemannian metric and the corresponding path metric, and if \ Gamma \ le G is a uniform lattice then \ Gamma is quasi-isometric to G.
- The general approach to traceback is to accumulate path metrics for up to five times the constraint length ( 5 ( " K "-1 ) ), find the node with the largest accumulated cost, and begin traceback from this node.
- It's difficult to find path metric in a sentence. 用path metric造句挺難的
- SOVA differs from the classical Viterbi algorithm in that it uses a modified path metric which takes into account the " a priori probabilities " of the input symbols, and produces a " soft " output indicating the " reliability " of the decision.
- However, computing the node which has accumulated the largest cost ( either the largest or smallest integral path metric ) involves finding the " maxima " or " minima " of several ( usually 2 " K "-1 ) numbers, which may be time consuming when implemented on embedded hardware systems.
- An alternate method that eliminates the need to monitor the path metric growth is to allow the path metrics to " roll over ", to use this method it is necessary to make sure the path metric accumulators contain enough bits to prevent the " best " and " worst " values from coming within 2 ( n-1 ) of each other.
- An alternate method that eliminates the need to monitor the path metric growth is to allow the path metrics to " roll over ", to use this method it is necessary to make sure the path metric accumulators contain enough bits to prevent the " best " and " worst " values from coming within 2 ( n-1 ) of each other.
- An alternate method that eliminates the need to monitor the path metric growth is to allow the path metrics to " roll over ", to use this method it is necessary to make sure the path metric accumulators contain enough bits to prevent the " best " and " worst " values from coming within 2 ( n-1 ) of each other.
- The Vietoris Rips complex of a set of points in a metric space is a special case of a clique complex, formed from the unit disk graph of the points; however, every clique complex " X ( G ) " may be interpreted as the Vietoris Rips complex of the shortest path metric on the underlying graph " G ".
- If If M is a complete finite volume hyperbolic 3-manifold with cusps, then \ Gamma = \ pi _ 1 ( M ) is quasi-isometric to \ Omega = \ mathbb H ^ 3-\ mathcal B, where \ mathcal B is a certain \ Gamma-invariant collection of horoballs, and where \ Omega is equipped with the induced path metric.
- Similar separator-based approximation schemes have also been used to approximate other hard problems such as vertex cover . use separators in a different way to approximate the travelling salesman problem for the shortest path metric on weighted planar graphs; their algorithm uses dynamic programming to find the shortest tour that, at each level of a separator hierarchy, crosses the separator a bounded number of times, and they show that as the crossing bound increases the tours constructed in this way have lengths that approximate the optimal tour.
- If ( M, g ) is a closed connected smooth manifold with a smooth Riemannian metric g then \ pi _ 1 ( M ) is quasi-isometric to ( \ tilde M, d _ { \ tilde g } ), where \ tilde M is the universal cover of M, where \ tilde g is the pull-back of g to \ tilde M, and where d _ { \ tilde g } is the path metric on \ tilde M defined by the Riemannian metric \ tilde g.